منابع مشابه
Degree-constrained editing of small-degree graphs
This thesis deals with degree-constrained graph modification problems. In particular, we investigate the computational complexity of DAG Realization and Degree Anonymity. The DAG Realization problem is, given a multiset of positive integer pairs, to decide whether there is a realizing directed acyclic graph (DAG), that is, pairs are one-to-one assigned to vertices such that the indegree and the...
متن کاملSmall degree out-branchings
Using a suitable orientation, we give a short proof of a result of Czumaj and Strothmann [3]: Every 2-edge-connected graph G contains a spanning tree T with the property that dT (v) ≤ dG(v)+3 2 for every vertex v. Trying to find an analogue of this result in the directed case, we prove that every 2-arc-strong digraph D has an out-branching B such that d+B(x) ≤ d+D(x) 2 + 1. As a corollary, ever...
متن کاملFinding Small Solutions to Small Degree Polynomials
This talk is a brief survey of recent results and ideas concerning the problem of finding a small root of a univariate polynomial mod N , and the companion problem of finding a small solution to a bivariate equation over Z. We start with the lattice-based approach from [2,3], and speculate on directions for improvement.
متن کاملImproving BitTorrent
We propose two new greedy algorithms to be used by software clients running the BitTorrent peer to peer protocol: a new peer selection algorithm and a new piece selection algorithm. We provide experimental results showing that the proposed algorithms are better than the ones currently in use. When used together in our experiments, the algorithms decreased the expected download time by ??% on av...
متن کاملSpanning Trees of Small Degree
In this paper we show that pseudo-random graphs contain spanning trees of maximum degree 3. More specifically, (n, d, λ)-graphs with sufficiently large spectral gap contain such spanning trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Periodica Polytechnica Electrical Engineering
سال: 2011
ISSN: 0031-532X,1587-3781
DOI: 10.3311/pp.ee.2011-3-4.03